Brief Announcement: Consistency and Complexity Tradeoffs for Highly-Available Multi-cloud Store

نویسندگان

  • Gregory Chockler
  • Dan Dobre
  • Alexander Shraer
  • A. Shraer
چکیده

Cloud storage services are becoming increasingly popular due to their flexible deployment, convenient pay-per-use model, and little (if any) administrative overhead. Today they are being offered by ever growing number of Internet companies, such as Amazon, Google, Microsoft as well as numerous smaller providers, such as Rackspace, Nirvanix and many others. Although cloud storage providers make tremendous investments into ensuring reliability and security of the service they offer, most of them have suffered from wellpublicized outages where the integrity and/or availability of data have been compromised for prolonged periods of time. In addition, even in the absence of outages, the customers can still lose access to their data due to connectivity problems, or unexpected alterations in the service contract (data lock-in). To address these concerns, multi-cloud storage systems whereupon data is replicated across multiple cloud storage services have become a hot topic in the systems community. Despite the significant progress in building practical multi-cloud storage systems (see e.g., [1]), as of today, little is known about their fundamental capabilities and limitations. The primary challenge lies in a wide variety of the storage interfaces and consistency semantics offered by different cloud providers to their external users. For example, whereas Amazon S3 supports a simple read/write interface, other storage services also expose a selection of more advanced transactional primitives, such as conditional writes. In this paper, we outline the results of our recent study [2] that explored the space and time complexity of building reliable multi-cloud storage services.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Consistency and Complexity Tradeoffs for Highly-Available Multi-Cloud Store

Cloud-based storage services have established themselves as a paradigm of choice for supporting bulk storage needs of modern networked services and applications. Although individual storage service providers can be trusted to do their best to reliably store the user data, exclusive reliance on any single provider or storage service leaves the users inherently at risk of being locked out of thei...

متن کامل

Consistency Management in Cloud Storage Systems

With the emergence of cloud computing, many organizations have moved their data to the cloud in order to provide scalable, reliable and high available services. As these services mainly rely on geographically-distributed data replication to guarantee good performance and high availability, consistency comes into question. The CAP theorem discusses tradeoffs between consistency, availability, an...

متن کامل

Exploiting Cost - Performance Tradeoffs for Modern Cloud Systems By

The trade-off between cost and performance is a fundamental challenge for modern cloud systems. This thesis explores cost-performance tradeoffs for three types of systems that permeate today’s clouds, namely (1) storage, (2) virtualization, and (3) computation. A distributed key-value storage system must choose between the cost of keeping replicas synchronized (consistency) and performance (lat...

متن کامل

Multi-view Multi-illuminant Intrinsic Dataset

This paper proposes a novel high-resolution multi-view dataset of complex multiilluminant scenes with precise reflectance and shading ground-truth as well as raw depth and 3D point cloud. Our dataset challenges the intrinsic image methods by providing complex coloured cast shadows, highly textured and colourful surfaces, and specularity. This is the first publicly available multi-view real-phot...

متن کامل

Building Data Structures on Untrusted Peer-to-Peer Storage with Per-participant Logs

L is a technique for building multi-user distributed data structures out of untrusted peer-to-peer distributed hash tables (DHTs). L uses multiple logs, one log per participant, to store changes to the data structure. Each participant finds data by consulting all logs, but performs modifications by appending only to its own log. This decentralized structure allows L to maintain meta-data consis...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013